BDD based lambda set selection in Roth-Karp decomposition for LUT architecture
نویسندگان
چکیده
Field Programmable Gate Arrays (FPGA’s) are important devices for rapid system prototyping. Roth-Karp decomposition is one of the most popular decomposition techniques for Look-Up Table (LUT)-based FPGA technology mapping. In this paper, we propose a novel algorithm based on Binary Decision Diagrams (BDD’s) for selecting good lambda set variables in Roth-Karp decomposition to minimize the number of consumed configurable logic blocks (CLB’s) in FPGA’s. The experimental results on a set of benchmarks show that our algorithm can produce much better results than those of the previous approach [1].
منابع مشابه
Computing support-minimal subfunctions during functional decomposition
The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techniques. Functional decomposition is a powerful decomposition method that breaks a Boolean function into a set of subfunctions and a composition function. Little attention has so far been given to the problem of selecting good subfunctio...
متن کاملA PC-Based Logic Simulator Using a Look-Up Table Cascade Emulator
This paper represents a cycle-based logic simulation method using an LUT cascade emulator, where an LUT cascade consists of multiple-output LUTs (cells) connected in series. The LUT cascade emulator is an architecture that emulates LUT cascades. It has a control part, a memory for logic, and registers. It connects the memory to registers through a programmable interconnection circuit, and evalu...
متن کاملBDD Representation for Incompletely Specified Multiple-Output Logic Functions and Its Applications to the Design of LUT Cascades
A multiple-output function can be represented by a binary decision diagram for characteristic function (BDD for CF). This paper presents a method to represent multiple-output incompletely specified functions using BDD for CFs. An algorithm to reduce the widths of BDD for CFs is presented. This method is useful for decomposition of incompletely specified multiple-output functions. Experimental r...
متن کاملPipelined Sms4 Cipher Design for Fast Encryption Using Twisted BDD S-Box Architecture
In this current fast moving world, getting the information faster is more important. My project makes it happen. SMS4 cipher based on Pipelined Twisted BDD (Binary Decision Diagram) S-box architecture can convert the plain text into cipher text as fast as other S-box architecture. SMS4 is a 128-bit block cipher used in the WAPI standard for protecting data packets in WLAN. In this project S-box...
متن کاملBoolean matching for LUT-based logic blocks with applications toarchitecture evaluation and technology mapping
In this paper, we present new Boolean matching methods for lookup table (LUT)-based programmable logic blocks (PLBs) and their applications to PLB architecture evaluations and field programmable gate array (FPGA) technology mapping. Our Boolean matching methods, which are based on functional decomposition operations, can characterize functions for complex PLBs consisting of multiple LUTs (possi...
متن کامل